CASSI - AN OPTIMAL ZEROS ASSIGNMENT METHOD FOR SOLVING ASSIGNMENT PROBLEMS

نویسندگان

چکیده

An assignment problem (AP) is a meticulous case ofa transportation problem, in which the goal to allocate number of facilities an equal activities at overall maximum profit (or minimum cost, distance, time). It occupies verysignificantrole real physical world. The well-known method applied solve APs Hungarian method, generates optimal solution given AP. A little bit difficulty cover all zero entries reduced cost matrix using horizontal and vertical lines. However, this task has been made easy if one applies ME Rulespresented Mantra technique. In research article, we make attempt bring new technique named asCASSIfor obtaining solutionto anygiven AP optimality testing improving added advantage that for any AP, obtained by applying based on zeros approach can be tested also improved towards optimal, its not optimal.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ones Assignment Method for Solving Assignment Problems

Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...

متن کامل

A New Approach for Solving Grey Assignment Problems

Linear assignment problem is one of the most important practical models in the literature of linear programming problems‎. ‎Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach‎. ‎In this way‎, ‎some researchers have used a whitening technique to solve the grey assignment p...

متن کامل

Solving Quadratic Assignment Problems

We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...

متن کامل

A New Method for Solving Fuzzy Assignment Problems

Abstract. A new method namely, parallel moving method is proposed to find an optimal solution to the fuzzy assignment problem considered in Lin and Wen [13]. We derive two theorems; one is related to an optimal solution to the fuzzy assignment problem and another is related to find an improved solution from the current solution to the fuzzy assignment problem. The parallel moving method provide...

متن کامل

Solving Large Quadratic Assignment Problems

Quadratic Assignment problems are in practice among the most diicult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space searched. Much work has been done to identify such functions for the QAP, but with limited success. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of advanced research

سال: 2022

ISSN: ['2707-7802', '2707-7810']

DOI: https://doi.org/10.21474/ijar01/14678